Universally Quantified Constraints for Planning
نویسنده
چکیده
In SATPLAN [4] a valid plan is encoded as a satisfying assignment of a set of propositional clauses. Unfortunately, the number of clauses is often impractically large. Even using clever, but arguably unnatural, encodings [3] can still give too many clauses. The origin of the size difficulty is simple. Planning encodings are naturally written in terms of universally quantified “lifted” clauses such as ∀ i, j, k. ¬ q(i, j) ∨ r(j, k) (1)
منابع مشابه
Universal Quantification in a Constraint-Based Planner
Constraints and universal quantification axe both useful in planning, but handling universally quantified constraints presents some noveI challenges. We present a general approach to proving the validity of universally quantified constraints. The approach essentially consists of checking that the constraint is not violated for all members of the universe. We show that this approach can sometime...
متن کاملUniversally Quantified Interval Constraints
Non-linear real constraint systems with universally and/or existentially quantified variables often need be solved in such contexts as control design or sensor planning. To date, these systems are mostly handled by computing a quantifier-free equivalent form by means of Cylindrical Algebraic Decomposition (CAD). However, CAD restricts its input to be conjunctions and disjunctions of polynomial ...
متن کاملUniversally Quantified Interval Constraint Solving An Application to Camera Control
Non-linear real constraint systems with universally/existentially quantified variables often need be solved in such contexts as control design or sensor planning. To date, these systems are mostly handled by computing a quantifier-free equivalent form by means of Cylindrical Algebraic/Trigonometric Decomposition (CAD/CTD). However, CAD and CTD restrict their input to be conjunctions and disjunc...
متن کاملAn Application to Camera Control
Non-linear real constraint systems with universally/existentially quantified variables often need be solved in such contexts as control design or sensor planning. To date, these systems are mostly handled by computing a quantifierfree equivalent form by means of Cylindrical Algebraic/Trigonometric Decomposition (CAD/CTD). However, CAD and CTD restrict their input to be conjunctions and disjunct...
متن کاملRepair-Based Methods for Quantified CSPs
The Quantified CSP (QCSP) is a generalization of the CSP which allows for universally quantified variables. For each possible sequence of assignments to such variables, we have to find a way to set the values of the remaining, existentially quantified, variables so that all the constraints are satisfied. Such problems arise in areas such as planning under uncertainty, model checking, and advers...
متن کامل